Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Partial interference alignment scheme with limited antenna resource in heterogeneous network
LI Shibao, WANG Yixin, ZHAO Dayin, YE Wei, GUO Lin, LIU Jianhang
Journal of Computer Applications    2019, 39 (7): 2030-2034.   DOI: 10.11772/j.issn.1001-9081.2018122456
Abstract364)      PDF (838KB)(220)       Save

To solve the problem that the antenna resources in heterogeneous network are limited which leads to the unrealizable Interference Alignment (IA), a partial IA scheme for maximizing the utilization of antenna resources was proposed based on the characteristics of heterogeneous network. Firstly, a system model based on partial connectivity in heterogeneous network was built and the feasibility conditions for entire system to achieve IA were analyzed. Then, based on the heterogeneity of network (the difference between transmitted power and user stability), the users were assigned to different priorities and were distributed with different antenna resources according to their different priorities. Finally, with the goal of maximizing total rate of system and the utilization of antenna resources, a partial IA scheme was proposed, in which the high-priority users had full alignment and low-priority users had the maximum interference removed. In the Matlab simulation experiment where antenna resources are limited, the proposed scheme can increase total system rate by 10% compared with traditional IA algorithm, and the received rate of the high-priority users is 40% higher than that of the low-priority users. The experimental results show that the proposed algorithm can make full use of the limited antenna resources and achieve the maximum total system rate while satisfying the different requirements of users.

Reference | Related Articles | Metrics
Improved modified gain extended Kalman filter algorithm based on back propagation neural network
LI Shibao, CHEN Ruixiang, LIU Jianhang, CHEN Haihua, DING Shuyan, GONG Chen
Journal of Computer Applications    2016, 36 (5): 1196-1200.   DOI: 10.11772/j.issn.1001-9081.2016.05.1196
Abstract518)      PDF (729KB)(423)       Save
In practical application, Modified Gain Extended Kalman Filter (MGEKF) algorithm generally uses erroneous measured values instead of the real values for calculation, so the modified results also contain errors. To solve this problem, an improved MGEKF algorithm based on Back Propagation Neural Network (BPNN), termed BPNN-MGEKF algorithm, was proposed in this paper. At BPNN training time, measured values were used as the input, and modified results by true values as the output. BPNN-MGEKF was applied to single moving station bearing-only position experiment. The experimental results shows that, BPNN-MGEKF improves the positioning accuracy of more than 10% compared to extended Kalman filter, MGEKF and smoothing modified gain extended Kalman filter algorithm, and it is more stable.
Reference | Related Articles | Metrics
Probabilistic forwarding algorithm of mobile Ad Hoc networks based on directional prediction
LI Shibao LOU Linlin CHEN Xiangrui HONG Li
Journal of Computer Applications    2013, 33 (08): 2117-2120.  
Abstract857)      PDF (650KB)(487)       Save
In Mobile Ad Hoc Network (MANET), each node forwards a message in the traditional routing protocol such as flooding and expanding ring search, which results in heavy overhead and long latency of routing. In order to improve the performance of routing protocol, a scheme of probabilistic forwarding algorithm was provided based on directional prediction. The information such as ID and time was extracted from data packets by monitoring network, and a table was established to store these records which can hint the distance to the destination node. Based on these records, the node's forwarding probability was calculated and adaptively adjusted according to the network. Whether some node should forward a packet depended on the forwarding probability, which was high enough only for sustaining the routing process towards the destination. The simulation results show that the routing overhead declined up to 70% compared with flooding algorithm and 20% compared with the classical probabilistic forwarding algorithm. The new scheme significantly improved the performance of the network.
Reference | Related Articles | Metrics